Verified computation of solutions for obstacle problems with guaranteed L∞ error bound
نویسندگان
چکیده
منابع مشابه
Sequential Computation of p-values based on (Re-)Sampling with a Guaranteed Error Bound
When explicit forms of p-values are not available or cannot be evaluated efficiently, e.g. in the case of a bootstrap test, one usually resorts to simulation. Especially when a simulation step is computationally expensive it is of interest to draw a small number of samples. This article introduces a sequential procedure to evaluate the p-value using simulation. It guarantees that, up to a small...
متن کاملBalanced Truncation for Stochastic Linear Systems with Guaranteed Error Bound
We consider model order reduction of stochastic linear systems by balanced truncation. Two types of Gramians are suggested, both satisfying generalized Lyapunov equations. The first is motivated by energy functionals, the second is taylored to yield an error bound for the truncated system.
متن کاملIntegrability for Solutions of Anisotropic Obstacle Problems
Correspondence should be addressed to Hongya Gao, [email protected] Received 30 March 2012; Revised 26 April 2012; Accepted 23 May 2012 Academic Editor: Martino Bardi Copyright q 2012 Hongya Gao et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is...
متن کاملLoss Minimization of Power Distribution Networks with Guaranteed Error Bound
Determining loss minimum configuration in a distribution network is a hard discrete optimization problem involving many variables. Since more and more dispersed generators are installed on the demand side of power systems and they are reconfigured frequently, developing automatic approaches is indispensable for effectively managing a large-scale distribution network. Existing fast methods emplo...
متن کاملVerified Error Bounds for Isolated Singular Solutions of Polynomial Systems
In this paper, we generalize the algorithm described by Rump and Graillat, as well as our previous work on certifying breadth-one singular solutions of polynomial systems, to compute verified and narrow error bounds such that a slightly perturbed system is guaranteed to possess an isolated singular solution within the computed bounds. Our new verification method is based on deflation techniques...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2001
ISSN: 0893-9659
DOI: 10.1016/s0893-9659(01)80040-9